On the heuristics of A* or A algorithm in ITS and robot path-planning
نویسندگان
چکیده
Based on many large data set, we calibrate a nearoptimal heuristic as a constant function for guiding efficiently A or A∗ algorithm. We claim that this magic number exists as a universal constant for several kinds of date sets. This is perhaps related to the nature of their data sets though it is not theoretically analyzed yet. In general, A∗ and Dijkstra algorithms always pick up the optimal (e.g., the shortest) path between two nodes on a given graph. However, because they do not use any good heuristics, they spend much time to calculate. To overcome this drawback, we propose A or A∗ algorithm with a smart heuristics. The algorithm quickly investigates an optimal or near-optimal path. Unfortunately, the heuristics does not always maintain the admissibility, and thus our algorithm does not sometimes pick up the optimal path. Finally, we ascertain superiority of the proposed algorithm to the classic A∗ and Dijkstra algorithms by two kinds of extremely different data sets.
منابع مشابه
Study of Evolutionary and Swarm Intelligent Techniques for Soccer Robot Path Planning
Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملDesigning Path for Robot Arm Extensions Series with the Aim of Avoiding Obstruction with Recurring Neural Network
In this paper, recurrent neural network is used for path planning in the joint space of the robot with obstacle in the workspace of the robot. To design the neural network, first a performance index has been defined as sum of square of error tracking of final executor. Then, obstacle avoidance scheme is presented based on its space coordinate and its minimum distance between the obstacle and ea...
متن کاملFormation Control and Path Planning of Two Robots for Tracking a Moving Target
This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...
متن کاملPath Planning and Control of an Industrial Robot Used for Opening Tap Hole of an Electric Arc Furnace
The electric arc furnace (EAF) is one of the popular methods of steel production from steel scraps. The plasma arc is used in EAF to generate heat for melting scarp or direct reduced iron (DRI). The liquid metal is drained from the EAF through the tap hole. Nowadays, it is critical to use Automated/robotic tools for opening the tap hole with oxygen lancing. Because many workers have been blinde...
متن کاملDynamics modeling and stable gait planning of a quadruped robot in walking over uneven terrains
Quadruped robots have unique capabilities for motion over uneven natural environments. This article presents a stable gait for a quadruped robot in such motions and discusses the inverse-dynamics control scheme to follow the planned gait. First, an explicit dynamics model will be developed using a novel constraint elimination method for an 18-DOF quadruped robot. Thereafter, an inverse-dynamics...
متن کامل